Monadic Second Order Probabilities in Algebra
نویسنده
چکیده
We analyze the question of existence of asymptotic cumulative probabilities for monadic second order deenable properties of nite algebras. We focus our attention on the directly representable varieties and on the variety of groups. We prove in a very strong way that some recently proven rst-order 0{1 laws and limit laws for these varieties cannot be extended to monadic second order logic. Namely, if the function (n; A) 7 ! pr n fAg] assigning probabilities to structures is recursive, then the 0{1 law holds according to the sequence fpr n g = pr 1 ; pr 2 ; : : : of probabilities ii asymptotically there exists fpr n g-almost surely precisely one algebra. Similarly, the convergence law holds ii asymptotically there are no large algebras according to fpr n g:
منابع مشابه
On Asymptotic Probabilities of Monadic Second Order
We propose a new, general and easy method for proving nonexistence of asymptotic probabilities of monadic second{order sentences in classes of nite structures where rst{order extension axioms hold almost surely.
متن کاملIndependence-friendly cylindric set algebras
Independence-friendly logic is a conservative extension of first-order logic that has the same expressive power as existential second-order logic. In her Ph.D. thesis, Dechesne introduces a variant of independence-friendly logic called IFG logic. We attempt to algebraize IFG logic in the same way that Boolean algebra is the algebra of propositional logic and cylindric algebra is the algebra of ...
متن کاملA logical approach to asymptotic combinatorics II: Monadic second-order properties
In Compton [3] we began an investigation of a general approach to asymptotic problems in combinatorics. These problems involve determining probabilities of certain properties holding in large, finite structures randomly chosen from certain classes. The properties we considered were those expressible in first order logic L,,, and the classes were those closed under disjoint unions and components...
متن کاملLimited Set quantifiers over Countable Linear Orderings
In this paper, we study several sublogics of monadic secondorder logic over countable linear orderings, such as first-order logic, firstorder logic on cuts, weak monadic second-order logic, weak monadic second-order logic with cuts, as well as fragments of monadic secondorder logic in which sets have to be well ordered or scattered. We give decidable algebraic characterizations of all these log...
متن کاملNonconvergence, undecidability, and intractability in asymptotic problems
Results delimiting the logical and effective content of asymptotic combinatorics are presented. For the class of binary relations with an underlying linear order, and the class of binary functions, there are properties, given by first-order sentences, without asymptotic probabilities; every first-order asymptotic problem (i.e., set of first-order sentences with asymptotic probabilities bounded ...
متن کامل